EXTENSION OF THE RELATIONAL DATABASE AND ITS ALGEBRA WITH ROUGH SET TECHNIQUES

This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database.     

Mining the change of customer behavior in fuzzy time-interval sequential patterns

Comprehending changes of customer behavior is an essential problem that must be faced for survival in a fast-changing business environment. Particularly in the management of electronic commerce (EC), many companies have developed on-line shopping stores to serve customers and immediately collect buying logs in databases. This trend has led to the development of data-mining applications. Fuzzy time-interval sequential pattern mining is one type of serviceable data-mining technique that discovers customer behavioral patterns over time. To take a shopping example, (Bread, Short, Milk, Long, Jam), means that Bread is bought before Milk in a Short period, and Jam is bought after Milk in a Long period, where Short and Long are predetermined linguistic terms given by managers. This information shown in this example reveals more general and concise knowledge for managers, allowing them to make quick-response decisions, especially in business. However, no studies, to our knowledge, have yet to address the issue of changes in fuzzy time-interval sequential patterns. The fuzzy time-interval sequential pattern, (Bread, Short, Milk, Long, Jam), became available in last year; however, is not a trend this year, and has been substituted by (Bread, Short, Yogurt, Short, Jam). Without updating this knowledge, managers might map out inappropriate marketing plans for products or services and dated inventory strategies with respect to time-intervals. To deal with this problem, we propose a novel change mining model, MineFuzzChange, to detect the change in fuzzy time-interval sequential patterns. Using a brick-and-mortar transactional dataset collected from a retail chain in Taiwan and a B2C EC dataset, experiments are carried out to evaluate the proposed model. We empirically demonstrate how the model helps managers to understand the changing behaviors of their customers and to formulate timely marketing and inventory strategies.     

Vague集的新模糊熵

本文指出了现有Vague集模糊熵定义的不足,分析了其存在不足的根本原因,给出了Vague集模糊熵的公理化定义,提出了一种新的Vague集模糊熵的计算方法,并证明了其合理性和有效性。     

一种基于分布约简的规则获取方法*

基于决策表分布约简定义规则的分布核与分布约简概念,提出一种基于分布约简的规则获取方法.首先确定条件类的分布核,进而采用启发式算法计算其分布约简,挖掘出最简产生式规则.该方法能适应决策表的不一致情形,且运用此方法所提取的规则集能够保持与原信息系统一致.     

粗糙集理论及其在图像处理中的应用*

首先描述了粗糙集理论的基本概念,包括粗糙集知识表示方法和粗糙集约简理论;叙述了粗糙集理论及其与其他非线性理论相结合在图像处理中的应用情况;最后指出了粗糙集理论应用于图像处理的基本思路,并指出将粗糙集理论与其他非线性理论相结合应用于图像处理,将会产生更加有效的结果.     

用稀疏相似性度量求解压缩传感矩阵

提出一种用稀疏相似性度量求解压缩传感矩阵的方法,并将其应用在图像重建和识别领域中.首先构造一种稀疏相似性度量,然后将其嵌入到传感矩阵的模糊代价函数中,最终传感矩阵的原子更新按照模糊方式进行计算.用该方法优化后的观测矩阵与字典矩阵之间保持了低相干性,并且样本的稀疏信号在相同重构条件下具备了更优的测量数目和质量.在ORL和FERET人脸数据库及91幅自然图像库上的实验结果验证了该算法的有效性.     

基于MPLS的VPN互访技术

针对VPN互访问题,根据IPSec-VPN互访方法的不足,提出动态MPLS-VPN方法.利用随机分配的标签,在需要互访的不同VPN网络节点之间构建MPLS通道,利用互访规则集检验节点的连接申请,根据过滤规则控制数据包的传输,通过设定传输时长限制节点互访的时间,实现VPN之间接节点、按方向、按时间的细粒度互访控制,确保数据传输的安全性和高效性.给出动态MPLS-VPN方法实现互访的步骤,对方法进行分析比较.     

改进的粗糙集属性权重确定方法

改进属性重要度概念,给出了一种基于粗糙集理论的单属性重要度和组合属性重要度结合的确定属性权重的方法及其具体操作步骤。通过实例说明,改进的粗糙集权重计算方法具有普适性,权重计算更合理。